On polling systems with large setups
نویسندگان
چکیده
منابع مشابه
On polling systems with large setups
Polling systems with large deterministic setup times find many applications in production environments. The present note studies the delay distribution in exhaustive polling systems when the setup times tend to infinity. Based on the recently proposed mean value analysis (MVA) for polling systems, a novel simple approach is developed to show that the scaled delay distribution converges to a uni...
متن کاملPolling Systems with Synchronization Constraints
We introduce a new service discipline called the synchronized gated discipline, for polling systems. It arises when there are precedence (or synchronization) constraints between the order that jobs in diierent queues should be served. These constraints are described as follows: There are N stations which are \fathers" of (zero or more) synchronized stations (\children"). Jobs that arrive to syn...
متن کاملOn two-queue Markovian polling systems with exhaustive service
We consider a class of two-queue polling systems with exhaustive service, where the order in which the server visits the queues is governed by a discrete-time Markov chain. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we obtain explicit expressions for the Laplace-Stieltjes trans...
متن کاملOn open problems in polling systems
In the present paper we address two open problems concerning polling systems, viz., queueing systems consisting of multiple queues attended by a single server that visits the queues one at a time. The first open problem deals with a system consisting of two queues, one of which has gated service, while the other receives 1-limited service. The second open problem concerns polling systems with g...
متن کاملOptimization of Polling Systems with Bernoulli Schedules
Many computer-communication networks in which the transmission right is circulated among the nodes have been modeled as polling systems. This paper concerns optimization of cyclic polling systems with respect to the service disciplines at the nodes. The service disciplines are chosen to be Bernoulli schedules. Because the optimization problem is not analytically tractable, a numerical approach ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2007
ISSN: 0167-6377
DOI: 10.1016/j.orl.2006.10.004